Parallel Ant Colony Optimization for the Quadratic Assignment Problems with Symmetric Multi Processing
نویسنده
چکیده
Recently symmetric multi processing (SMP) has become available at a reasonable cost. In this paper, we propose several types of parallel ACO algorithms with SMP for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ACO algorithms is promising in solving QAPs.
منابع مشابه
Multi Colony Ant Algorithms
In multi colony ant algorithms several colonies of ants cooperate in finding good solutions for an optimization problem. At certain time steps the colonies exchange information about good solutions. If the amount of exchanged information is not too large multi colony ant algorithms can be easily parallelized in a natural way by placing the colonies on different processors. In this paper we stud...
متن کاملA Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in many fields. Many real world applications such as backboard wiring, typewriter keyboard design and scheduling can be formulated as QAPs. Ant colony algorithm is a multi-agent system inspired by behaviors of real ant colonies to solve optimization problems. Ant colony optimization (ACO) is one of new ...
متن کاملParallel Ant Colonies for Combinatorial Optimization Problems
Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is...
متن کاملAnt Colony Optimization for Optimal Control Problems
Abstract. Ant algorithm optimization is used to solve a general class of optimal control problems with single input control. The discretized form of the optimal control problem is converted to a quasi quadratic assignment problem in the time-control space. By applying the ant optimization algorithm on this problem, a piece-wise constant approximation is obtained for the optimal control. Impleme...
متن کاملParallel Ant Colonies for the quadratic assignment problem
Ant Colonies optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). The cooperation between simulated ants is provided by a pheromone matrix that plays the role of a global memory. The exploration of the search space is guided by the evolution of p...
متن کامل